On Completeness of Reasoning about Planar Spatial Relationships in Pictorial Retrieval Systems∗
نویسندگان
چکیده
In this paper we consider the completeness problem of reasoning about planar spatial relationships in pictorial retrieval systems. We define a large class of two-dimensional scenes, the extended pseudo-symbolic pictures. The existing rule system R is proved to be complete for (extended) pseudo-symbolic pictures. We also introduce a new iconic indexing, the (extended) pseudo2D string representation, for them. The (extended) pseudo-2D string has the good properties of the 2D string. It is unambiguous, like the augmented 2D string, and has a compact form suitable for image retrieval. We then present efficient algorithms to determine whether a given planar picture is (extended) pseudo-symbolic or not, and if it is, these algorithms also return its (extended) pseudo-2D string representation. Picture retrieval by (extended) pseudo-2D strings is also discussed.
منابع مشابه
Finding Minimal and Maximal Sets of Spatial Relationships in Pictorial Retrieval Systems
Spatial reasoning is an important component in pictorial retrieval systems. There are two approaches to handling spatial relationships: the well-known one is to use algorithms on which most earlier work such as [13, 17, 21] is based, and the recent one [30] is to construct deductive rules that allow spatial relationships to be deduced. Sistla et al. [30] developed a system of rules R on reasoni...
متن کاملReasoning About Spatial Relationships in Picture Retrieval Systems
In this paper, we consider various spatial relationships that are of general interest in pictorial database systems. We present a set of rules that allow us to deduce new relationships from a given set of relationships. A deductive mechanism using these rules can be used in query processing systems that retrieve pictures by content. The given set of rules are shown to be sound, i.e. the deducti...
متن کاملA Prime-Number-based Matrix strategy for efficient iconic indexing of symbolic pictures
In the previous approaches to represent pictorial data as the complexity of the represen tation strategy is increased the more spatial relationships can be represented which also results in a more complex strategy for query processing and a limited types of queries that can be answered In this paper we propose an e cient iconic indexing scheme called Prime Number based Matrix PN Matrix for symb...
متن کاملSimilarity retrieval of iconic image database
-The perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images in an iconic image database system. The data structure called 2D string, proposed by Chang et al., is adopted to represent symbolic pictures. The 2D string preserves the objects' spatial knowledge embedded in images. Since spatial relationship is...
متن کاملA Three-Dimensional Iconic Environment for Image Database Querying
Retrieval by contents of images from pictorial databases can be effectively performed through visual icon-based systems. In these systems, the representation of pictures with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct iconic indexes for pictures and is also an ideai representation for the visual query. With this approach, retrieva...
متن کامل